On some approximately balanced combinatorial cooperative games
نویسندگان
چکیده
A model of taxation for cooperative n-person games is introduced where proper coalitions are taxed proportionally to their value. Games with non-empty core under taxation at rate e are a-balanced. Sharp bounds on e in matching games on (not necessarily bipartite) graphs are established. Upper and lower bounds on the smallest e in bin packing games are derived and euclidean random TSP games are seen to be, with high probability, e-balanced for e ~ 0.06.
منابع مشابه
Universally Balanced Combinatorial Optimization Games
This article surveys studies on universally balanced properties of cooperative games defined in a succinct form. In particular, we focus on combinatorial optimization games in which the values to coalitions are defined through linear optimization programs, possibly combinatorial, that is subject to integer constraints. In economic settings, the integer requirement reflects some forms of indivis...
متن کاملCooperative Benefit and Cost Games under Fairness Concerns
Solution concepts in cooperative games are based on either cost games or benefit games. Although cost games and benefit games are strategically equivalent, that is not the case in general for solution concepts. Motivated by this important observation, a new property called invariance property with respect to benefit/cost allocation is introduced in this paper. Since such a property can be regar...
متن کاملAgent Failures in Totally Balanced Games and Convex Games
We examine the impact of independent agents failures on the solutions of cooperative games, focusing on totally balanced games and the more speci c subclass of convex games. We follow the reliability extension model, recently proposed in [1] and show that a (approximately) totally balanced (or convex) game remains (approximately) totally balanced (or convex) when independent agent failures are ...
متن کاملAlgorithms and Complexity in Combinatorial Optimization Games
We introduce an integer programming formulation for a class of combinatorial optimization games, which includes many interesting problems on graphs. We prove a simple (but very useful) theorem that the core, an important solution concept in cooperative game theory that no subset of players should be able to gain advantage by breaking away from the collective decision of all playerss40, 45], is ...
متن کاملProduction-inventory games: A new class of totally balanced combinatorial optimization games
In this paper we introduce a new class of cooperative games that arise from production-inventory problems. Several agents have to cover their demand over a finite time horizon and shortages are allowed. Each agent has its own unit production, inventory-holding and backlogging cost. Cooperation among agents is given by sharing production processes and warehouse facilities: agents in a coalition ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- ZOR - Meth. & Mod. of OR
دوره 38 شماره
صفحات -
تاریخ انتشار 1993